Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams

نویسندگان

  • Min Wan
  • Gianfranco Ciardo
چکیده

We propose a new type of canonical decision diagrams, which allows a more efficient symbolic state-space generation for general asynchronous systems by allowing on-the-fly extension of the possible state variable domains. After implementing both breadth-first and saturationbased state-space generation with this new data structure in our tool SmArT, we are able to exhibit substantial efficiency improvements with respect to traditional “static” decision diagrams. Since our previous works demonstrated that saturation outperforms breadth-first approaches, saturation with this new structure is now arguably the state-of-the-art algorithm for symbolic state-space generation of asynchronous systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Eecient Symbolic State-space Construction for Asynchronous Systems ?

Many techniques for the veri cation of reactive systems rely on the analysis of their reachable state spaces. In this paper, a new algorithm for the symbolic generation of the state spaces of asynchronous system models, such as Petri nets, is developed. The algorithm is based on previous work that employs Multi-valued Decision Diagrams for e ciently storing sets of reachable states. In contrast...

متن کامل

A Fine-Grained Fullness-Guided Chaining Heuristic for Symbolic Reachability Analysis

Chaining can reduce the number of iterations required for symbolic state-space generation and model-checking, especially in Petri nets and similar asynchronous systems, but requires considerable insight and is limited to a static ordering of the events in the high-level model. We introduce a two-step approach that is instead fine-grained and dynamically applied to the decision diagrams nodes. T...

متن کامل

Saturation: An E cient Iteration Strategy for Symbolic State{Space Generation?

We present a novel algorithm for generating state spaces of asynchronous systems using Multi{valued Decision Diagrams. In contrast to related work, we encode the next{state function of a system not as a single Boolean function, but as cross{products of integer functions. This permits the application of various iteration strategies to build a system's state space. In particular, we introduce a n...

متن کامل

Saturation: an Eecient Iteration Strategy for Symbolic State{space Generation ?

We present a novel algorithm for generating state spaces of asynchronous systems using Multi{valued Decision Diagrams. In contrast to related work, we encode the next{state function of a system not as a single Boolean function, but as cross{products of integer functions. This permits the application of various iteration strategies to build a system's state space. In particular, we introduce a n...

متن کامل

Saturation: An Efficient Iteration Strategy for Symbolic State-Space Generation

This paper presents a novel algorithm for generating state spaces of asynchronous systems using Multi-valued Decision Diagrams. In contrast to related work, the next-state function of a system is not encoded as a single Boolean function, but as cross-products of integer functions. This permits the application of various iteration strategies to build a system's state space. In particular, this p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009